How E#iciently Can We Target Prolific O#enders?

نویسنده

  • Ken Pease
چکیده

This report looks at the magnitude of crime perpetrated by the most active offenders in a particular police area and places it in the context of a research programme which seeks to integrate and render locally useful the major findings of applied criminology. The results are contrasting. In terms of all crime, the group of offenders nominated did not appear to contribute substantially to levels of crime. The level of burglary did not bear any relationship to the availability of nominated burglars. The volume of vehicle-related crime (unlawful taking, theft of and theft from a motor vehicle) did vary according to the number of nominated offenders available. Breaking down to neighbourhood level, only one area displayed a relationship between levels of vehicle crime and the availability of nominated offenders to commit crime. Furthermore, there was some evidence that this group accounted for a component of other crime types, namely burglary and criminal damage. Two areas failed to produce any meaningful relationship between nominated offenders and crime levels. The results have major implications for the mechanism used to nominate prolific offenders and the resources used to target such individuals. It is argued that refinement and local application of the kinds of analysis described here would be of great utility in shaping offender-targeting practices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories

vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...

متن کامل

Task Scheduling for Heterogeneous Multicore Systems

In recent years, as the demand for low energy and high performance computing has steadily increased, heterogeneous computing has emerged as an important and promising solution. Because most w orkloads can typically run most eff iciently on certain types of cores, mapping tasks on the best available resources can not only save energy but also deliver high performance. How ever, optimal task sche...

متن کامل

How to Target Balanced Scorecard Indicators in a DEA-BSC Integrated Model

Performance measurement is always one of the most important tasks of managers, so knowledge management is measurement knowledge, and if we can measure something, we can no doubt control it, and therefore we cannot manage it. In this paper, according to the Malmquist productivity index, an index is used to determine the progress and regress of a unit. This index is defined by the boundary change...

متن کامل

Satisfaction Function in Present Undesirable Factors

Data Envelopment Analysis (DEA) is an efficient method to perform evaluation of units. In DEA we try to evaluate units with undesirable factors in input & outputs by satisfaction function, testing some models. On the other hand benefiting this concept, we can identify non-efficient units. Also we can recognize why these units are inefficient and calculate the reason of their inefficiency and ho...

متن کامل

The Astrophysics Simulation Collaboratory Portal: A Science Portal Enabling Community Software Development

Grid Portals, based o n standard web technologies, are emerging as important and useful u ser interfaces to Computat ional and Da ta Grids. Grid portals enable Vir tual Organizations, comprised of distributed researchers t o collaborate and access resources more eff iciently and seamlessly. T h e Astrophysics Simulat ion Collaboratory (ASC) Grid Portal provides a framework t o enable researcher...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017